Call Performance for a PCS Network
نویسندگان
چکیده
It is well known that, due to the mobility of a portable and limited channel availability, calls of portables may not be completed due to being blocked or terminated during the call initiation or the handover process. The characteristics of the call-completion and call-holding times for both a complete call and an incomplete call are of critical importance for establishing the actual billing process in the PCS network. In this paper, we derive the call-completion probability (hence, call-dropping probability) and the effective call-holding time distributions for complete/incomplete calls with a general cell-residence time and a general call-holding time are analyzed, and general computable formulas are obtained. We show that when call-holding times are Erlang distributed, easy-to-compute formulas for the probability of a call completion and the expected effective call-holding times for both a complete call and an incomplete call can be derived.
منابع مشابه
Performance analysis of a PCS network with state-dependent calls arrival processes and impatient calls
This paper studies the behavior of performance evaluation for a personal communication services (PCS) network, in which the calls' arrival process may depend on the number of calls in the target cells. Each cell of the PCS network consists of a ®nite channel and a buffer (with ®nite or in®nite size) for handoff calls. The handoff calls having to wait in the buffer for further communication may ...
متن کاملModeling PCS Networks Under General Call Holding Time And Cell Residence Time Distributions - Networking, IEEE/ACM Transactions on
In a personal communication service (PCS) network, the call completion probability and the effective call holding times for both complete and incomplete calls are central parameters in the network cost/performance evaluation. These quantities will depend on the distributions of call holding times and cell residence times. The classical assumptions made in the past that call holding times and ce...
متن کاملPCS networks with correlated arrival process and retrial phenomenon
In this paper, the arrival of new calls and handoff calls to a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. A new call will retry again if the first attempt is blocked. The PCS network consists of homogeneous ce...
متن کاملPerformance Analysis for Dual Band PCS Networks
ÐIn a dual band personal communications services (PCS) network, heavy traffic areas are covered by microcells which overlay macrocells. In such a network, microcells and macrocells utilize different frequency bands. We propose an analytic model to study the performance of a dual band PCS architecture. Our model assumes that a PCS subscriber has a general residence time distribution in a microce...
متن کاملA New Mobility Model and Its Application in the Channel Holding Time Characterization in PCS Network
In order to capture the essence of PCS network behavior, a good mobility model is necessary. This model must be good enough to fit field data and make the resulting queueing model still tractable. In this paper, we propose a new mobility model, called hyper-Erlang distribution model, which satisfies the above two requirements. We use this model to characterize the cell residence time and obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 15 شماره
صفحات -
تاریخ انتشار 1997